The COMICS Tool - Computing Minimal Counterexamples for Discrete-time Markov Chains
نویسندگان
چکیده
This report presents the tool COMICS 1.0, which performs model checking and generates counterexamples for DTMCs. For an input DTMC, COMICS computes an abstract system that carries the model checking information and uses this result to compute a critical subsystem, which induces a counterexample. This abstract subsystem can be refined and concretized hierarchically. The tool comes with a command-line version as well as a graphical user interface that allows the user to interactively influence the refinement process of the counterexample.
منابع مشابه
The COMICS Tool - Computing Minimal Counterexamples for DTMCs
This paper presents the tool COMICS 1.0, which performs model checking and generates counterexamples for DTMCs. For an input DTMC, COMICS computes an abstract system that carries the model checking information and uses this result to compute a critical subsystem, which induces a counterexample. This abstract subsystem can be refined and concretized hierarchically. The tool comes with a command ...
متن کاملDiPro - A Tool for Probabilistic Counterexample Generation
The computation of counterexamples for probabilistic model checking has been an area of active research over the past years. In spite of the achieved theoretical results in this field, there is no freely available tool that allows for the computation and representation of probabilistic counterexamples. We present an open source tool called DiPro that can be used with the PRISM and MRMC probabil...
متن کاملMinimal Critical Subsystems for Discrete-Time Markov Models
We propose a new approach to compute counterexamples for violated ω-regular properties of discrete-time Markov chains and Markov decision processes. Whereas most approaches compute a set of system paths as a counterexample, we determine a critical subsystem that already violates the given property. In earlier work we introduced methods to compute such subsystems based on a search for shortest p...
متن کاملHierarchical Counterexamples for Discrete-Time Markov Chains
This paper introduces a novel counterexample generation approach for the verification of discrete-time Markov chains (DTMCs) with two main advantages: (1) We generate abstract counterexamples which can be refined in a hierarchical manner. (2) We aim at minimizing the number of states involved in the counterexamples, and compute a critical subsystem of the DTMC whose paths form a counterexample....
متن کاملMinimal counterexamples for linear-time probabilistic verification
Counterexamples for property violations have a number of important applications like supporting thedebugging of erroneous systems and verifying large systems via counterexample-guided abstraction refinement.In this paper, we propose the usage of minimal critical subsystems of discrete-time Markov chains and Markovdecision processes as counterexamples for violated ω-regular propertie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1206.0603 شماره
صفحات -
تاریخ انتشار 2012